Constructions of 3-Colorable Cores
نویسندگان
چکیده
منابع مشابه
The Complexity of the Haj
The Hajj os Calculus is a simple, nondeterministic procedure which generates the class of non-3-colorable graphs. Mansseld and Welsch MW] posed the question of whether there exist graphs which require exponential-sized Hajj os constructions. Unless NP 6 = coNP, there must exist graphs which require exponential-sized constructions, but to date, little progress has been made on this question, des...
متن کاملExponential Lower Bounds for the Tree-Like Hajós Calculus
The Hajj os Calculus is a simple, nondeterministic procedure which generates precisely the class of non-3-colorable graphs. In this note, we prove exponential lower bounds on the size of tree-like Hajj os constructions .
متن کاملA Construction of Uniquely n-Colorable Digraphs with Arbitrarily Large Digirth
A natural digraph analogue of the graph-theoretic concept of an ‘independent set’ is that of an ‘acyclic set’, namely a set of vertices not spanning a directed cycle. Hence a digraph analogue of a graph coloring is a decomposition of the vertex set into acyclic sets and we say a digraph is uniquely n-colorable when this decomposition is unique up to relabeling. It was shown probabilistically in...
متن کاملGraph coloring satisfying restraints
For an integer k 2 2, a proper k-restraint on a graph G is a function from the vertex set of G to the set of k-colors. A graph G is amenably k-colorable if, for each nonconstant proper k-restraint r on G, there is a k-coloring c of G with c(v) # r(v) for each vertex v of G. A graph G is amenable if it is amenably k-colorable and k is the chromatic number of G. For any k Z= 3, there are infinite...
متن کاملPlanar graphs with girth at least 5 are (3, 5)-colorable
A graph is (d1, . . . , dr )-colorable if its vertex set can be partitioned into r sets V1, . . . , Vr where themaximum degree of the graph induced by Vi is at most di for each i ∈ {1, . . . , r}. Let Gg denote the class of planar graphs with minimum cycle length at least g . We focus on graphs in G5 since for any d1 and d2, Montassier and Ochem constructed graphs in G4 that are not (d1, d2)-co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Discrete Math.
دوره 16 شماره
صفحات -
تاریخ انتشار 2002